Entity Data Management in OKKAM.

Exploration of Discovered Process Views in Process Spaceship.

Entity Lifecycle Management for OKKAM.
Abstract. In this paper, we examine the special requirements of lifecycle management for entities in the context of an entity management system for the semantic web. We study the requirements with respect to creating and modifying these entities, as well as to managing their evolution over time. Furthermore, we present the issues arising from the access control models needed for the management of a large, distributed repository of entities. Finally, we discuss the research directions that can offer solutions to the above problems, and give a brief overview of techniques and methods relevant to these solution directions.
Automating the Generation of Semantic Annotation Tools Using a Clustering Technique.
Natural Language and


Overview and semantic issues of text mining.

Clean Answers over Dirty Databases A Probabilistic Approach.
The detection of duplicate tuples, corresponding to the same real-world entity, is an important task in data integration and cleaning. While many techniques exist to identify such tuples, the merging or elimination of duplicates can be a difficult task that relies on ad-hoc and often manual solutions. We propose a complementary approach that permits declarative query answering over duplicated data, where each duplicate is associated with a probability of being in the clean database. We rewrite queries over a database containing duplicates to return each answer with the probability that the answer is in the clean database. Our rewritten queries are sensitive to the semantics of duplication and help a user understand which query answers are most likely to be present in the clean database. The semantics that we adopt is independent of the way the probabilities are produced, but is able to effectively exploit them during query answering. In the absence of external knowledge that associates each database tuple with a probability, we offer a technique, based on tuple summaries, that automates this task. We experimentally study the performance of our rewritten queries. Our studies show that the rewriting does not introduce a significant overhead in query execution time. This work is done in the context of the ConQuer project at the University of Toronto, which focuses on the efficient management of inconsistent and dirty databases. 1
Improving the Build Architecture of Legacy C%2FC   Software Systems.

Reducing Build Time through Precompilations for Evolving Large Software.

Information%2DTheoretic Software Clustering.

LIMBO Scalable Clustering of Categorical Data.
Abstract. Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, when there is no inherent distance measure between data values. We introduce LIMBO, a scalable hierarchical categorical clustering algorithm that builds on the Information Bottleneck (IB) framework for quantifying the relevant information preserved when clustering. As a hierarchical algorithm, LIMBO has the advantage that it can produce clusterings of different sizes in a single execution. We use the IB framework to define a distance measure for categorical tuples and we also present a novel distance measure for categorical attribute values. We show how the LIMBO algorithm can be used to cluster both tuples and values. LIMBO handles large data sets by producing a memory bounded summary model for the data. We present an experimental evaluation of LIMBO, and we study how clustering quality compares to other categorical clustering algorithms. LIMBO supports a trade-off between efficiency (in terms of space and time) and quality. We quantify this trade-off and demonstrate that LIMBO allows for substantial improvements in efficiency with negligible decrease in quality. 1
Information%2DTheoretic Tools for Mining Database Structure from Large Data Sets.
Data design has been characterized as a process of arriving at a design that maximizes the information content of each piece of data (or equivalently, one that minimizes redundancy). Information content (or redundancy) is measured with respect to a prescribed model for the data, a model that is often expressed as a set of constraints. In this work, we consider the problem of doing data redesign in an environment where the prescribed model is unknown or incomplete. Specifically, we consider the problem of finding structural clues in an instance of data, an instance which may contain errors, missing values, and duplicate records. We propose a set of information-theoretic tools for finding structural summaries that are useful in characterizing the information content of the data, and ultimately useful in data design. We provide algorithms for creating these summaries over large, categorical data sets. We study the use of these summaries in one specific physical design task, that of ranking functional dependencies based on their data redundancy. We show how our ranking can be used by a physical data-design tool to find good vertical decompositions of a relation (decompositions that improve the information content of the design). We present an evaluation of the approach on real data sets. 1.
Kanata Adaptation and Evolution in Data Sharing Systems.

Using Categorical Clustering in Schema Discovery.
Most techniques for managing relational schemas assume a given schema that adequately models the data [1].H owever, we know that in practice, the semantics of the data may evolve over time and its schema (the data structures and constraints) is not always updated to reflect these changes [5] . Common examples include the overloading of tables to store facts of different types (for example, an order table originally designed to store service orders may be used to store various product orders as a company expands the scope of its business). Similarly, the semantics (typically represented as constraints) may evolve, perhaps because new data does not share the original semantics or because the full semantics were not captured in the original legacy design. Our long term research goal is to find techniques for discovering schemas that fit the data. In this work, we are taking an initial step toward this goal. Specifically, we are examining the benefits of using categorical clustering to discover groupings of tuples that share similar structural characteristics.
Software Clustering based on Information Loss Minimization.

Schema Discovery.
Structured data is distinguished from unstructured data by the presence of a schema describing the logical structure and semantics of the data. The schema is the means through which we understand and query the underlying data. The schema permits the more sophisticated structured queries that are not possible over schema-less data. Most systems assume that the schema is predefined and is an accurate reflection of the data. This assumption is often not valid in networked databases that may contain data originating from many sources and may not be valid within legacy databases where the semantics of data have evolved over time. As a result, querying and tasks that depend on structured queries (including data integration and schema mapping) may not be effective. In this paper, we consider the problem of discovering schemas from data. We focus on discovering properties of data that can be exploited in querying and transforming data. Finally, we very briefly consider the suitability of mining approaches to the task of schema discovery.
Schema Management.
Clio is a management system for heterogeneous data that couples a traditional database management engine with additional tools for managing schemas (models of data) and mappings between schemas. In this article, we provide a brief overview of Clio and place our solutions in the context of the rich research literature on data integration and transformation. Clio is the result of an on-going collaboration between the University of Toronto and IBM Almaden Research Center in which we are addressing both foundational and systems issues related to heterogeneous data, schema, and integration management.
Reverse Engineering Meets Data Analysis.
We demonstrate how the data management techniques known as On--Line Analytical Processing, or OLAP, can be used to enhance the sophistication and range of software reverse engineering tools. This is the first comprehensive examination of the similarities and differences in these tasks both in how OLAP techniques meet (or fail to meet) the needs of reverse engineering and in how reverse engineering can be recast using data analysis. To permit the seamless integration of these technologies, we extend a multidimensional data model to manage dynamically changing dimensions (over which data can be aggregated). We use a case study of the Apache web server to show how our solutions permit an integrated view of data ranging from low level program analysis information to abstract, aggregate information. These high--level abstractions may be provided either by humans (perhaps using a visualization tool) or directly from reverse engineering tools or data mining techniques.
